An upper bound for self-dual codes
نویسندگان
چکیده
منابع مشابه
An Upper Bound for Self-Dual Codes
Gleason has described the general form that the weight distribution of a self-dual code over GF(2) and GF(3) can have. We give an explicit formula for this weight distribution when the minimum distance d between codewords is made as large as possible. It follows that for self-dual codes of length n over GF(2) with all weights divisible by 4, d ~ 4[n/24] + 4; and for self-dual codes over GF(3), ...
متن کاملAn improved upper bound on the minimum distance of doubly-even self-dual codes
We derive a new upper bound on the minimum distance of doubly-even self-dual codes of length . Asymptotically, for growing, it gives lim sup (5 5 ) 10
متن کاملA new upper bound on the minimal distance of self-dual codes
It is shown that the minimal distance d of a binary self-dual code of length n ≥ 74 is at most2 [ (n + 6 )/10 ]. This bound is a consequence of some new conditions on the weight enumerator ofa self-dual code obtained by considering a particular translate of the code called its ‘‘shadow’’.These conditions also enable us to find the highest possible minimal distance of a self-dual...
متن کاملAn upper bound for the minimum weight of the dual codes of desarguesian planes
We show that a construction described in Clark, Key and de Resmini [9] of small-weight words in the dual codes of finite translation planes can be extended so that it applies to projective and affine desarguesian planes of any order p where p is a prime, and m ≥ 1. This gives words of weight 2p + 1 − p −1 p−1 in the dual of the p-ary code of the desarguesian plane of order p, and provides an im...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1973
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(73)90273-8